Design of Elliptic Curves with Controllable Lower Boundary of Extension Degree for Reduction Attacks
نویسندگان
چکیده
In this paper, we present a design strategy of elliptic curves whose extension degrees needed for reduction attacks have a controllable lower boundary, based on the complex multiplication elds method of Atkin and Morain over prime elds.
منابع مشابه
Degree Reduction of Disk Wang-Bézier Type Generalized Ball Curves
A disk Wang-Bézier type generalized Ball curve is a Wang-Bézier type generalized Ball curve whose control points are disks in a plane. It can be viewed as a parametric curve with error tolerances. In this paper, we discuss the problem of degree reduction of disk Wang-Bézier type generalized Ball curve, that is, bounding disk Wang-Bézier type generalized Ball curves with lower degree disk Wa...
متن کاملDegree Reduction of Disk Wang-Bézier Type Generalized Ball Curves
A disk Wang-Bézier type generalized Ball curve is a Wang-Bézier type generalized Ball curve whose control points are disks in a plane. It can be viewed as a parametric curve with error tolerances. In this paper, we discuss the problem of degree reduction of disk Wang-Bézier type generalized Ball curve, that is, bounding disk Wang-Bézier type generalized Ball curves with lower degree disk Wa...
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملComplete characterization of the Mordell-Weil group of some families of elliptic curves
The Mordell-Weil theorem states that the group of rational points on an elliptic curve over the rational numbers is a finitely generated abelian group. In our previous paper, H. Daghigh, and S. Didari, On the elliptic curves of the form $ y^2=x^3-3px$, Bull. Iranian Math. Soc. 40 (2014), no. 5, 1119--1133., using Selmer groups, we have shown that for a prime $p...
متن کاملSummation Polynomial Algorithms for Elliptic Curves in Characteristic Two
The paper is about the discrete logarithm problem for elliptic curves over characteristic 2 finite fields F2n of prime degree n. We consider practical issues about index calculus attacks using summation polynomials in this setting. The contributions of the paper include: a choice of variables for binary Edwards curves (invariant under the action of a relatively large group) to lower the degree ...
متن کامل